Permutable Power Series and Regular Iteration
نویسنده
چکیده
convergent for \z\ < p, where p > 0, then f(z) is said to have a fixpoint of multiplier ax at 2 = 0. In the (local) iteration of/(?) one studies the sequence {/„(*)},» = 0, 1, 2, • • • in a neighbourhood of z — 0, /n(z) being defined by /oto = * . / « « = / 0 i t o } ^r » = 1 , 2 , 3 , . . . For many values of the multiplier ax, including 0 < \ax\ < 1 and \ax\ > 1, the local iteration of f(z) is completely mastered by the introduction of Schroder's functional equation
منابع مشابه
Regular Expressions for Provenance
As noted by Green et al. several provenance analyses can be considered a special case of the general problem of computing formal polynomials resp. power-series as solutions of an algebraic system. Specific provenance is then obtained by means of evaluating the formal polynomial under a suitable homomorphism. Recently, we presented the idea of approximating the least solution of such algebraic s...
متن کاملAxiomatizing rational power series
Iteration semirings are Conway semirings satisfying Conway’s group identities. We show that the semirings Nrat〈〈Σ∗〉〉 of rational power series with coefficients in the semiring N of natural numbers are the free partial iteration semirings. Moreover, we characterize the semirings Nrat ∞ 〈〈Σ∗〉〉 as the free semirings in the variety of iteration semirings defined by three additional simple identitie...
متن کاملConstructive aspects of Riemann’s permutation theorem for series
The notions of permutable and weak-permutable convergence of a series ∑∞ n=1 an of real numbers are introduced. Classically, these two notions are equivalent, and, by Riemann’s two main theorems on the convergence of series, a convergent series is permutably convergent if and only if it is absolutely convergent. Working within Bishop-style constructive mathematics, we prove that Ishihara’s prin...
متن کاملIDEMPOTENT n-PERMUTABLE VARIETIES
One of the important classes of varieties identified in tame congruence theory is the class of varieties which are n-permutable for some n. In this paper we prove two results: (1) For every n > 1 there is a polynomial-time algorithm which, given a finite idempotent algebra A in a finite language, determines whether the variety generated by A is n-permutable; (2) A variety is n-permutable for so...
متن کاملSeries Solutions of Algebraic and Diierential Equations: a Comparison of Linear and Quadratic Algebraic Convergence 1 Newton Iteration in a Power Series Domain
Speed of convergence of Newton-like iterations in an algebraic domain can be aaected heavily by the increasing cost of each step, so much so that a quadratically convergent algorithm with complex steps may be comparable to a slower one with simple steps. This note gives two examples: solving algebraic and rst-order ordinary diierential equations using the MACSYMA algebraic manipulation system, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008